منابع مشابه
A Bayes consistent 1-NN classifier
We show that a simple modification of the 1-nearest neighbor classifier yields a strongly Bayes consistent learner. Prior to this work, the only strongly Bayes consistent proximity-based method was the k-nearest neighbor classifier, for k growing appropriately with sample size. We will argue that a margin-regularized 1-NN enjoys considerable statistical and algorithmic advantages over the k-NN ...
متن کاملGauge - invariant formulation of NN → NN γ
H. Haberzettl1,* and K. Nakayama2,3,† 1Institute for Nuclear Studies and Department of Physics, The George Washington University, Washington, DC 20052, USA 2Department of Physics and Astronomy, University of Georgia, Athens, GA 30602, USA 3Institut für Kernphysik and Jülich Center for Hadron Physics, Forschungszentrum Jülich, 52425 Jülich, Germany (Received 8 November 2010; revised manuscript r...
متن کاملN ov 1 99 8 1 Precise strength of the π NN coupling constant
We report here a preliminary value for the πNN coupling constant deduced from the GMO sumrule for forward πN scattering. As in our previous determination from np backward differential scattering cross sections we give a critical discussion of the analysis with careful attention not only to the statistical, but also to the systematic uncertainties. Our preliminary evaluation gives g c (GMO) = 13...
متن کاملThe NN scattering 3 S 1 − 3 D 1 mixing angle at NNLO
The S1−D1 mixing angle for nucleon-nucleon scattering, ǫ1, is calculated to next-to-next-to-leading order in an effective field theory with perturbative pions. Without pions, the low energy theory fits the observed ǫ1 well for momenta less than ∼ 50 MeV. Including pions perturbatively significantly improves the agreement with data for momenta up to ∼ 150 MeV with one less parameter. Furthermore...
متن کاملFast k-NN search
Random projection trees have proven to be effective for approximate nearest neighbor searches in high dimensional spaces where conventional methods are not applicable due to excessive usage of memory and computational time. We show that building multiple trees on the same data can improve the performance even further, without significantly increasing the total computational cost of queries when...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Molecules
سال: 2000
ISSN: 1420-3049
DOI: 10.3390/m159